Intervals of permutations with a fixed number of descents are shellable
نویسندگان
چکیده
منابع مشابه
Intervals of permutations with a fixed number of descents are shellable
The set of all permutations, ordered by pattern containment, is a poset. We present an order isomorphism from the poset of permutations with a fixed number of descents to a certain poset of words with subword order. We use this bijection to show that intervals of permutations with a fixed number of descents are shellable, and we present a formula for the Möbius function of these intervals. We p...
متن کاملEnumeration of permutations by number of alternating descents
In this paper we present an explicit formula for the number of permutations with a given number of alternating descents. As an application, we obtain an interlacing property for the zeros of alternating Eulerian polynomials.
متن کاملPermutations with extremal number of fixed points
Abstract. We extend Stanley’s work on alternating permutations with extremal number of fixed points in two directions: first, alternating permutations are replaced by permutations with a prescribed descent set; second, instead of simply counting permutations we study their generating polynomials by number of excedances. Several techniques are used: Désarménien’s desarrangement combinatorics, Ge...
متن کاملMinimal permutations with d descents
Recently, Bouvel and Pergola initiated the study of a special class of permutations, minimal permutations with a given number of descents, which arise from the whole genome duplication-random loss model of genome rearrangement. In this paper, we show that the number of minimal permutations of length 2d− 1 with d descents is given by 2d−3(d− 1)cd, where cd is the d-th Catalan number. We also der...
متن کاملDescents of Permutations in a Ferrers Board
The classical Eulerian polynomials are defined by setting An(t) = ∑ σ∈Sn t = n ∑ k=1 An,kt k where An,k is the number of permutations of length n with k − 1 descents. Let An(t, q) = ∑ π∈Sn t 1+des(π)qinv(π) be the inv q-analogue of the classical Eulerian polynomials whose generating function is well known: ∑ n>0 uAn(t, q) [n]q! = 1 1− t ∑ k>1 (1− t)kuk [k]q! . (0.1) In this paper we consider pe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2016
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.08.004